Load-dependent speed optimization in maritime inventory routing

Optimization in maritime inventory routing

Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing

We present two decomposition algorithms for single product deep-sea maritime inventory routing problems (MIRPs) that possess a core substructure common in many real-world applications. The problem involves routing vessels, each belonging to a particular vessel class, between loading and discharging ports, each belonging to a particular region. Our algorithms iteratively solve a MIRP by zooming ...

Recent Progress Using Matheuristics for Strategic Maritime Inventory Routing

This paper presents an extensive computational study of simple, but prominent matheuristics (i.e., heuristics that rely on mathematical programming models) to find high quality ship schedules and inventory policies for a class of maritime inventory routing problems. Our computational experiments are performed on a set of the publicly available MIRPLib instances. This class of inventory routing ...

A joint routing and speed optimization problem

Vehicle speed plays a significant role on fuel consumption and greenhouse gas emissions in freight transportation. We study a general joint routing and speed optimization problem with the goal of minimizing the total fuel, emission, and labor costs; the fuel consumption and emission rate is allowed to be an arbitrary strictly convex function of vehicle speed. We propose a novel set partitioning...

Ship speed optimization: concepts, models and combined speed-routing scenarios

The purpose of this paper is to clarify some important issues as regards ship speed optimization at the operational level and develop models that optimize ship speed for a spectrum of routing scenarios in a single ship setting. The paper’s main contribution is the incorporation of those fundamental parameters and other considerations that weigh heavily in a ship owner's or charterer's speed dec...